Multithreaded two-pass connected components labelling and particle analysis in ImageJ

نویسندگان

چکیده

Sequential region labelling, also known as connected components is a standard image segmentation problem that joins contiguous foreground pixels into blobs. Despite its long development history and widespread use across diverse domains such bone biology, materials science geology, labelling can still form bottleneck in processing pipelines. Here, I describe multithreaded implementation of classical two-pass sequential introduce an efficient collision resolution step, ‘ bucket fountain’ . Code was validated on test images against commercial software (Avizo). It performance tested from 2 MB (161 particles) to 6.5 GB (437 508 determine whether theoretical linear scaling ( O (n)) had been achieved, 1–40 CPU threads measure speed improvements due multithreading. The new achieves b = 0.905–1.052, time ∝ ; R 0.985–0.996), which improves with increasing thread number up 8–16 threads, suggesting it memory bandwidth limited. This reduces the required hours few tens seconds for several GB, limited only by hardware scale. available open source free charge BoneJ.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single Pass Connected Components Analysis

The classic connected components labelling algorithm requires a minimum of 2 passes through an image. This paper presents a modification of this algorithm that allows the resolution of merged labels to be deferred. This enables the subsequent data analysis step to be combined with the labelling procedure, with the result that connected components can be analysed in a single pass by gathering da...

متن کامل

Accelerated hardware object extraction and labelling: from object segmentation to connected components labelling

This paper demonstrates the use of a single-chip FPGA for the segmentation of moving objects in a video sequence. The system maintains highly accurate background models, and integrates the detection of foreground pixels with the conversion into labelled objects using a connected component labelling algorithm. The background models are based on 24-bit RGB values and 8-bit greyscale intensity val...

متن کامل

Two-connected graphs with prescribed three-connected components

We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree tc(g) associated with any 2-connected graph g, whose white vertices are the 3-components of g (3-connected components or polygons) and whose black vertices are b...

متن کامل

The Connected Components of two GaugeGroups

We calculate the connected components of the Gauge group of a Z/2 equivariant oriented 3-plane bundle and a related 4-plane bundle over the antipodal 3-sphere. This suggests that an obstruction which has earlier been claimed to vanish, does not necessarily do so.

متن کامل

Sequence Labelling SVMs Trained in One Pass

This paper proposes an online solver of the dual formulation of support vector machines for structured output spaces. We apply it to sequence labelling using the exact and greedy inference schemes. In both cases, the per-sequence training time is the same as a perceptron based on the same inference procedure, up to a small multiplicative constant. Comparing the two inference schemes, the greedy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Royal Society Open Science

سال: 2021

ISSN: ['2054-5703']

DOI: https://doi.org/10.1098/rsos.201784